Lengths are coordinates for convex structures
نویسنده
چکیده
Suppose that N is a geometrically finite hyperbolic 3-manifold such that the bending locus of its convex core is a collection of simple closed curves α. We prove that the map which associates to each structure the lengths of the curves in the bending locus is a global diffeomorphism from the set of all structures bent along α onto its image. If α is maximal, the traces of the curves αi ∈ α are local parameters for the representation space R(N).
منابع مشابه
A HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملWhen can a graph form an orthogonal polyhedron?
Polyhedra are an important basic structure in computational geometry. One of the most beautiful results concerning polyhedra is Cauchy’s theorem, which states that a convex polyhedron is uniquely defined by its graph, edge lengths and facial angles. (See Section 2 for definitions.) The proof of Cauchy’s theorem (see e.g. [2]) unfortunately is nonconstructive, and the only known algorithm to rec...
متن کاملModeling of Optimal Distances of Surveying Stations for Monitoring Astable Engineering Structures Using Geodetic Methods
Large and astable engineering structures are the great importance and the behavior of such structures is usually made in Geotechnical and Geodetic methods (engineering geodesy). In the geodetic methods, the selection of appropriate surveying stations, in terms of distribution, locations, and distant of the target points to stations the control network, have a significant role in determining th...
متن کاملFuzzy convergence structures in the framework of L-convex spaces
In this paper, fuzzy convergence theory in the framework of $L$-convex spaces is introduced. Firstly, the concept of $L$-convex remote-neighborhood spaces is introduced and it is shown that the resulting category is isomorphic to that of $L$-convex spaces. Secondly, by means of $L$-convex ideals, the notion of $L$-convergence spaces is introduced and it is proved that the category of $L$-con...
متن کامل